- connected vertices
- связанные вершины (графа)
English-Russian scientific dictionary. 2008.
connected vertices
Смотреть что такое "connected vertices" в других словарях:
Connected-component labeling — (alternatively connected component analysis, blob extraction, region labeling, blob discovery, or region extraction) is an algorithmic application of graph theory, where subsets of connected components are uniquely labeled based on a given… … Wikipedia
Connected Component Labeling — (alternatively connected component analysis) is an algorithmic application of graph theory, where subsets of connected components are uniquely labeled based on a given heuristic. Connected component labeling is not to be confused with… … Wikipedia
Connected component (graph theory) — A graph with three connected components. In graph theory, a connected component of an undirected graph is a subgraph in which any two vertices are connected to each other by paths, and which is connected to no additional vertices. For example,… … Wikipedia
Connected dominating set — In graph theory, a connected dominated set and a maximum leaf spanning tree are two closely related structures defined on an undirected graph. Contents 1 Definitions 2 Complementarity 3 Algorithms 4 Applic … Wikipedia
Connected space — For other uses, see Connection (disambiguation). Connected and disconnected subspaces of R² The green space A at top is simply connected whereas the blue space B below is not connected … Wikipedia
K-vertex-connected graph — In graph theory, a graph G with vertex set V(G) is said to be k vertex connected (or k connected) if G setminus X is connected for all X subseteq V(G) with left| X ight| < k. In plain English, a graph is k connected if the graph remains connected … Wikipedia
Doubly connected edge list — The doubly connected edge list (DCEL) is a data structure to represent an embedding of a planar graph in the plane and polytopes in 3D. This data structure provides efficient manipulation of the topological information associated with the objects … Wikipedia
Cube-connected cycles — The cube connected cycles of order 3, arranged geometrically on the vertices of a truncated cube. In graph theory, the cube connected cycles is an undirected cubic graph, formed by replacing each vertex of a hypercube graph by a cycle. It was… … Wikipedia
Doubly-connected edge list — The doubly connected edge list (DCEL) is a data structure to represent an embedding of a planar graph in the plane and polytopes in 3D. This data structure provide efficient manipulation of the topological information associated with the objects… … Wikipedia
strongly connected — adjective a) Of a directed graph, such that for every pair of vertices u and v there is a path from u to v and a path from v to u. b) Of a directed graph, such that for every pair of vertices u and v there is a directed path either from u to v or … Wiktionary
Polygon mesh — A polygon mesh or unstructured grid is a collection of vertices, edges and faces that defines the shape of a polyhedral object in 3D computer graphics and solid modeling. The faces usually consist of triangles, quadrilaterals or other simple… … Wikipedia
